FuzzyPSReg: Strategies of Fuzzy Cluster-Based Point Set Registration
نویسندگان
چکیده
This article studies the fuzzy cluster-based point set registration (FuzzyPSReg). First, we propose a new metric based on Gustafson–Kessel (GK) clustering to measure alignment of two clouds. Unlike c-means (FCM) in our previous work, GK-based includes orientation properties clouds, thereby providing more information for registration. We then develop quality assessment metric, which is sensitive small misalignments than that FCM-based metric. Next, by effectively combining metrics, design FuzzyPSReg strategies with global optimization. 1) FuzzyPSReg-SS , extends work and aligns similar-sized clouds greatly improved efficiency. 2) xmlns:xlink="http://www.w3.org/1999/xlink">FuzzyPSReg-O2S relatively large difference size can be used estimate pose an object scene. In experiment, use different test compare proposed method state-of-the-art approaches. The results demonstrate advantages effectiveness method.
منابع مشابه
Density Adaptive Point Set Registration
Probabilistic methods for point set registration havedemonstrated competitive results in recent years. Thesetechniques estimate a probability distribution model of thepoint clouds. While such a representation has shownpromise, it is highly sensitive to variations in the den-sity of 3D points. This fundamental problem is primar-ily caused by changes in the sensor location...
متن کاملA Correlation-Based Approach to Robust Point Set Registration
Correlation is a very effective way to align intensity images. We extend the correlation technique to point set registration using a method we call kernel correlation. Kernel correlation is an affinity measure, and it is also a function of the point set entropy. We define the point set registration problem as finding the maximum kernel correlation configuration of the the two point sets to be r...
متن کاملSmooth point-set registration using neighboring constraints
We present an approach for Maximum Likelihood estimation of correspondence and alignment parameters that benefits from the representational skills of graphs. We pose the problem as one of mixture modelling within the framework of the Expectation-Maximization algorithm. Our mixture model encompasses a Gaussian density to model the point-position errors and a Bernoulli density to model the struct...
متن کاملN-View Point Set Registration: A Comparison
Recently 3 algorithms for registration of multiple partially overlapping point sets have been published by Pennec [11], Stoddart & Hilton [12] and Benjemma & Schmitt [1]. The problem is of particular interest in the building of surface models from multiple range images taken from several viewpoints. In this paper we perform a comparison of these three algorithms with respect to cpu time, ease o...
متن کاملStochastic Optimization for Rigid Point Set Registration
In this paper we propose a new method for pairwise rigid point set registration. We pay special attention to noise robustness, outlier resistance and global optimal alignment. The problem of registering two point clouds in space is converted to a minimization of a nonlinear cost function. We propose a cost function that aims to reduce the impact of noise and outliers. Its definition is based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics
سال: 2022
ISSN: ['1552-3098', '1941-0468', '1546-1904']
DOI: https://doi.org/10.1109/tro.2021.3123898